Weak βη-Normalization and Normalization by Evaluation for System F
نویسنده
چکیده
A general version of the fundamental theorem for System F is presented which can be instantiated to obtain proofs of weak βand βη-normalization and normalization by evaluation.
منابع مشابه
η-conversions of IPC implemented in atomic F
It is known that the β-conversions of the full intuitionistic propositional calculus (IPC) translate into βη-conversions of the atomic polymorphic calculus Fat. Since Fat enjoys the property of strong normalization for βη-conversions, an alternative proof of strong normalization for IPC considering β-conversions can be derived. In the present paper we improve the previous result by analyzing th...
متن کاملTyped Applicative Structures and Normalization by Evaluation for System F
We present a normalization-by-evaluation (NbE) algorithm for System F with βη-equality, the simplest impredicative type theory with computation on the type level. Values are kept abstract and requirements on values are kept to a minimum, allowing many different implementations of the algorithm. The algorithm is verified through a general model construction using typed applicative structures, ca...
متن کاملTyped Applicative Structures and Normalization by Evaluation for System Fomega
We present a normalization-by-evaluation (NbE) algorithm for System F with βη-equality, the simplest impredicative type theory with computation on the type level. Values are kept abstract and requirements on values are kept to a minimum, allowing many different implementations of the algorithm. The algorithm is verified through a general model construction using typed applicative structures, ca...
متن کاملStrong Normalization by Type-Directed Partial Evaluation and Run-Time Code Generation
We investigate the synergy between type-directed partial evaluation and run-time code generation for the Caml dialect of ML. Typedirected partial evaluation maps simply typed, closed Caml values to a representation of their long βη-normal form. Caml uses a virtual machine and has the capability to load byte code at run time. Representing the long βη-normal forms as byte code gives us the abilit...
متن کاملNormalization by hereditary substitutions
We analyze a normalization function for the simply typed λ-calculus based on hereditary substitutions, a technique developed by Pfenning et al. The normalizer is implemented in Agda, a total language where all programs terminate. It requires no termination proof since it is structurally recursive which is recognized by Agda’s termination checker. Using Agda as an interactive theorem prover we e...
متن کامل